Node Histogram vs. Edge Histogram: A Comparison of PMBGAs in Permutation Domains
نویسندگان
چکیده
Previous papers have proposed an algorithm called the edge histogram sampling algorithm (EHBSA) that models the relative relation between two nodes (edge) of permutation strings of a population within the PMBGA framework for permutation domains. This paper proposes another histogram based model we call the node histogram sampling algorithm (NHBSA). The NHBSA models node frequencies at each absolute position in strings of a population. Sampling methods are similar to that of EHBSA. Performance of NHBSA is compared with that of EHBSA using two types of permutation problems: the FSSP and the quadratic assignment problem (QAP). The results showed that the NHBSA works better than the EHBSA on these problems.
منابع مشابه
Using Edge Histogram Models to Solve Permutation Problems with Probabilistic Model-Building Genetic Algorithms
Recently, there has been a growing interest in probabilistic model-building genetic algorithms (PMBGAs), which replace traditional variation operators of genetic and evolutionary algorithms by building and sampling a probabilistic model of promising solutions. In this paper we propose a PMBGA that uses edge histogram based sampling algorithms (EHBSAs) to solve problems with candidate solutions ...
متن کاملProbabilistic Model-Building Genetic Algorithms in Permutation Representation Domain Using Edge Histogram
Recently, there has been a growing interest in developing evolutionary algorithms based on probabilistic modeling. In this scheme, the offspring population is generated according to the estimated probability density model of the parent instead of using recombination and mutation operators. In this paper, we have proposed probabilistic model-building genetic algorithms (PMBGAs) in permutation re...
متن کاملSolving Sequence Problems by Building and Sampling Edge Histograms
Recently, there has been a growing interest in developing evolutionary algorithms based on probabilistic modeling. In this scheme, the offspring population is generated according to the estimated probability density model of the parent instead of using recombination and mutation operators. In this paper, we have proposed probabilistic model-building genetic algorithms (PMBGAs) in permutation re...
متن کاملUsing Edge Histogram Models to Solve Flow Shop Scheduling Problems with Probabilistic Model- Building Genetic Algorithms
In evolutionary algorithms based on probabilistic modeling, the offspring population is generated according to the estimated probability density model of the parent instead of using recombination and mutation operators. In this chapter, we have proposed a probabilistic model-building genetic algorithms (PMBGAs) for solving flow shop scheduling problems using edge histogram based sampling algori...
متن کاملEffect of Local Search on Edge Histogram Based Sampling Algorithms for Permutation Problems
One of the most promising research directions that focus on eliminating the drawbacks of fixed, problem-independent genetic algorithms, is to look at the generation of new candidate solutions as a learning problem, and use a probabilistic model of selected solutions to generate the new ones [5,9,10]. The algorithms based on learning and sampling a probabilistic model of promising solutions to g...
متن کامل